#Goldbach Conjecture

def is_prime(num):
	if num <= 1:
		return False
	for i in range(2, num):
		if num % i==0:
			return False
	return True


n = int(input())

for i in range(2, n //2 + 1):
    if is_prime(i) == True and is_prime(n - i) == True:
        print(n, '=', i, '+', n-i)